Rhombic Embeddings of Planar Quad-graphs
نویسنده
چکیده
Given a finite or infinite planar graph all of whose faces have degree 4, we study embeddings in the plane in which all edges have length 1, that is, in which every face is a rhombus. We give a necessary and sufficient condition for the existence of such an embedding, as well as a description of the set of all such embeddings. Résumé. Etant donné un graphe planaire, fini ou infini, dont toutes les faces sont de degré 4, on étudie ses plongements dans le plan dont toutes les arêtes sont de longueur 1, c’est à dire dont toutes les faces sont des losanges. On donne une condition nécessaire et suffisante pour l’existence d’un tel plongement, et on décrit l’ensemble de ces plongements.
منابع مشابه
ar X iv : m at h - ph / 0 30 50 57 v 1 2 7 M ay 2 00 3 Rhombic embeddings of planar graphs with faces of degree 4 Richard
Given a finite or infinite planar graph all of whose faces have degree 4, we study embeddings in the plane in which all edges have length 1, that is, in which every face is a rhombus. We give a necessary and sufficient condition for the existence of such an embedding, as well as a description of the set of all such embeddings.
متن کاملar X iv : m at h - ph / 0 30 50 57 v 1 2 7 M ay 2 00 3 Rhombic embeddings of planar graphs with faces of degree 4
Given a finite or infinite planar graph all of whose faces have degree 4, we study embeddings in the plane in which all edges have length 1, that is, in which every face is a rhombus. We give a necessary and sufficient condition for the existence of such an embedding, as well as a description of the set of all such embeddings.
متن کاملBond percolation on isoradial graphs: Criticality and universality
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star–triangle transformation, by transporting the box-crossing property across the family of isoradial ...
متن کاملBond Percolation on Isoradial Graphs
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star–triangle transformation, by transporting the box-crossing property across the family of isoradial ...
متن کاملPlanar graphs on the projective plane
It is shown that embeddings of planar graphs in the projective plane have very specific structure. By exhibiting this structure we indirectly characterize graphs on the projective plane whose dual graphs are planar. Whitney's Theorem about 2-switching equivalence of planar embeddings is generalized: Any two embeddings of a planar graph in the projective plane can be obtained from each other by ...
متن کامل